Search results for "Iterative algorithm"

showing 4 items of 4 documents

Change-point estimation in piecewise constant regression models and extensions

2015

Change-point iterative algorithm random effects linear change-pointSettore SECS-S/01 - Statistica
researchProduct

Input-to-state stability for discrete-time nonlinear switched singular systems

2016

Discrete-time nonlinear switched singular systems (SSSs) are investigated.The input-to-state stability (ISS) problems for discrete-time nonlinear SSSs are concerned.The ISS criteria are obtained via average dwell time approach and iterative algorithm of discrete-time systems.The switching rules are optimized and designed. This paper investigates the input-to-state stability (ISS) problems for a class of discrete-time nonlinear switched singular systems (SSSs). Two novel ISS criteria are proposed based on average dwell time (ADT) approach and iterative algorithm of discrete-time systems (IADS). In particular, the following two cases are considered for the underlying systems: the first case i…

Lyapunov function0209 industrial biotechnologyInformation Systems and ManagementIterative method02 engineering and technologyStability (probability)Theoretical Computer Sciencesymbols.namesake020901 industrial engineering & automationExponential stabilityControl theoryArtificial IntelligenceIterative algorithm0202 electrical engineering electronic engineering information engineeringMathematicsSwitched singular systemInput-to-state stabilityProcess (computing)Computer Science Applications1707 Computer Vision and Pattern RecognitionAverage dwell time; Discrete-time system; Input-to-state stability; Iterative algorithm; Nonlinear system; Switched singular system; Control and Systems Engineering; Theoretical Computer Science; Software; Computer Science Applications1707 Computer Vision and Pattern Recognition; Information Systems and Management; Artificial IntelligenceComputer Science ApplicationsNonlinear systemDwell timeDiscrete time and continuous timeDiscrete-time systemControl and Systems EngineeringsymbolsNonlinear system020201 artificial intelligence & image processingAverage dwell timeSoftware
researchProduct

A Branch-and-Cut method for the Capacitated Location-Routing Problem

2011

International audience; Recent researches in the design of logistic networks have shown that the overall distribution cost may be excessive if routing decisions are ignored when locating depots. The Location-Routing Problem (LRP) overcomes this drawback by simultaneously tackling location and routing decisions. The aim of this paper is to propose an exact approach based on a Branch-and-Cut algorithm for solving the LRP with capacity constraints on depots and vehicles. The proposed method is based on a zero-one linear model strengthened by new families of valid inequalities. The computational evaluation on three sets of instances (34 instances in total), with 5–10 potential depots and 20–88 …

Dynamic Source RoutingMathematical optimizationGeneral Computer ScienceComputer scienceEqual-cost multi-path routingRouting tableTesting0211 other engineering and technologiesGeographic routingLogistics02 engineering and technologyManagement Science and Operations ResearchBranch and CutSimulated annealingStochastic processesBranch-and-CutLocation-RoutingVehicle routing problem0202 electrical engineering electronic engineering information engineeringFacility locationDestination-Sequenced Distance Vector routingRoutingMathematicsStatic routing021103 operations researchLocation routingLower BoundLinear modelVehiclesIterative algorithms[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]Facility location problemVehicle routingCostsLocation-Routing ProblemLink-state routing protocolLagrangian functionsModeling and SimulationMultipath routing020201 artificial intelligence & image processingFittingRouting (electronic design automation)Branch and cutDrawback
researchProduct

Wideband modeling of cascaded H-plane waveguide junctions using the generalised impedance matrix representation

2009

A strong interest in H-plane waveguide components composed of a large number of cascaded planar junctions is recently renewed. Therefore, the more efficient development of full-wave analysis tools of such devices is again receiving consideration, specially for its potential use within modern design tools. A novel technique for providing the wideband generalised impedance matrix representation of the inductive devices in the form of pole expansions, thus extracting the most expensive computations from the frequency loop is proposed. For such purpose, the whole device is first decomposed into simpler building blocks, i.e. planar junctions and uniform waveguides, which are modelled in terms of…

EngineeringIterative methodNovel techniquesWaveguide filterElectric impedance measurementImpedance parametersMatrix algebralaw.inventionImpedance matricesPlanarlawFull wave analysisIterative algorithmElectronic engineeringPlanar junctionsElectrical and Electronic EngineeringWidebandRepresentation (mathematics)Pole expansionWaveguide filterbusiness.industryBuilding blockesWide-bandDesign toolH-plane waveguidebusinessWaveguideWaveguidesMatrix method
researchProduct